منابع مشابه
Feasible Programs from Proofs
We restrict induction and recursion on notation in all nite types so as to characterize the polynomial time computable functions. The restrictions are obtained by enriching the type structure with the formation of types (and formulas A (B as well as 8 x A with \complete" variables x, and by adding linear concepts to the lambda calculus (for object terms and proof terms). For the arithmetical sy...
متن کاملEliminating Negation from Normal Logic Programs
In this paper, we propose a bottom-up partial evaluation of normal programs with a top-down expansion of negated atoms to obtain equivalent logic programs. A program P is transformed to P by a bottom-up computation on the positive component of P while the negative counterpart is left untouched. During this process, we collect all substitutions describing a partial answer set to all the positive...
متن کاملEliminating Proofs of Interference-freedom from Levin-Gries CSP Program Proofs
The proof system for Hoare's CSP language proposed by Levin and Gries requires that for each predicate used in the proof of a process interference-freedom proofs be given--for each command that can be executed in parallel with the code of the process. In the worse case, the effort required to provide such proofs could be enormous. To address this proble!rl, Levin and Gries suggest the use of s)...
متن کاملBind Induction: Extracting Monadic Programs from Proofs
Container types can be modeled as instances of the Haskell MonadPlus type class which support a fold operation. In this paper we present subclasses that extend the MonadPlus type class to support a membership operator. The laws for the EMonadPlus type class specify how membership behaves with respect to the monad and monad plus operators. Using EMonads we are able write and prove properties of ...
متن کاملExtraction of Structured Programs from Specification Proofs
We present a method using an extended logical system for obtaining \correct" programs from speciications written in a sublanguage of CASL. By \correct" we mean programs that satisfy their speciications. The technique we use is to extract programs from proofs in formal logic by techniques due to Curry and Howard. The logical calculus, however, has the novel feature that as well as the convention...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80505-x